منابع مشابه
Path Optimization for Graph Partitioning Problems
This paper presents a new heuristic for graph partitioning called Path Optimization (PO), and the results of an extensive set of empirical comparisons of the new algorithm with two very well-known algorithms for partitioning: the Kernighan-Lin algorithm and simulated annealing. Our experiments are described in detail, and the results are presented in such a way as to reveal performance trends b...
متن کاملExpected Complexity of Graph Partitioning Problems
We study the expected time complexity of two graph partitioning problems: the graph coloring and the cut into equal parts. Hk = o( Jn/ logn), we can test whether two vertices of a k-colorable graph can be k-colored by the same color in time O(klogn) per pair of vertices with O(k4 10g3n)time preprocessing in such a way that for almost all k-colorable graphs the answer is correct for all pairs of...
متن کاملApproximation Algorithms for Some Graph Partitioning Problems
This paper considers problems of the following type: given an edgeweighted k-colored input graph with maximum color class size c, find a minimum or maximum c-way cut such that each color class is totally partitioned. Equivalently, given a weighted complete k-partite graph, cover its vertices with a minimum number of disjoint cliques in such a way that the total weight of the cliques is maximize...
متن کاملCsc5160: Combinatorial Optimization and Approximation Algorithms Topic: Graph Partitioning Problems 18.1 Graph Partitioning Problems 18.1.2 Multiway Cut
This lecture gives a general introduction of graph partitioning problems. We will begin with the definitions of some classic graph partitioning problems (e.g. multiway cut, multicut, sparsest cut), and discuss their relationships. Then we will focus on deriving two approximation algorithms. For the multiway cut problem, we will show a 2-approximation algorithm through a combinatorial argument. ...
متن کاملHyper Graph and Coprocessor Design for Vlsi Partitioning Problems
VLSI Cell partitioning is considered as Hypergraph model, which can be a treated a randomized algorithm through the markov chain. This approach helps to give a probabilistic algorithm through transition probability matrices of a markov chain for VLSI partitioning. In the second model SAT problem situation is used to model FPGA Layout. As almost all problems posed in VLSI design and analysis are...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Brain & Neural Networks
سال: 2014
ISSN: 1340-766X,1883-0455
DOI: 10.3902/jnns.21.162